optimal tree meaning in Chinese
最优树
Examples
- A new heuristic search method is devised for maximum likelihood method , which first constructs a starting tree , and then through branch swapping searches for trees best resembling the present optimal tree and locates a better tree . repeat this process , till no more better trees are generated or the upper iteration limit is arrived and the program ends
对最大似然法,改进了一种新的启发式搜索:随机建立一棵初始树,然后通过查看与当前最优树拓扑最近的树,从中寻找更优树,不断地更新当前最优树,直到无法找到更优树或者达到了搜索次数的上限,算法停止。 - By computing the cost of the cheapest subtree with size constraints of the partial tree ( this is an upper bound on the cost of the final optimal tree ) and lower bounds on the cost of subtrees of varying sizes that are rooted at nodes of the partial tree , the algorithms can identify and prune nodes that cannot possibly belong to the optimal constrainted subtree
建树阶段设置大小限制的修剪算法是通过计算出不完整树的最小代价得到优化树的代价上限，根据此上限以及计算出的节点的实际代价来修剪节点的。在预测模型中应用了在建树阶段加入大小限制条件的修剪算法。 - Some existing topology - unaware collective operations algorithms do n ' t make use of the information about network topology . firstly , these approaches construct a model of network topology and make use of a set of parameters to describe the communication characteristics of a network model , then build the optimal trees based parameter values and their models to realize collective communication
现有的一些未知拓扑型集合通信算法，并不利用网络拓扑结构信息，都是首先对网络模型化，并且用各种参数来描述该模型中网络通信的特点，然后基于此模型和其参数值为集合通信操作构造最优树来实现集合通信。